Computational problem - PDFSEARCH.IO - Document Search Engine

Computational problem
Results: 1172

#	Item
971	A Computational Study of External-Memory BFS Algorithms∗ Deepak Ajwani † Roman Dementiev Add to Reading List Source URL: algo2.iti.kit.edu Language: English - Date: 2006-02-27 07:49:44 Search algorithms Breadth-first search Network theory NP-complete problems Line graph Graph traversal Shortest path problem Graph partition Adjacency list Graph theory Mathematics Theoretical computer science
972	Element Distinctness, Frequency Moments, and Sliding Windows Rapha¨el Clifford University of Bristol, UK arXiv:[removed] Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 07:07:19 Element distinctness problem Ordinal number Computational complexity theory Probability theory Analysis of algorithms Conjectures Theoretical computer science Applied mathematics SL
973	MSc Applicable Mathematics September 2012 Entrants Further Information Booklet Week 1.1; University Week[removed]QA Queen Anne Building Add to Reading List Source URL: staffweb.cms.gre.ac.uk Language: English - Date: 2012-09-14 03:51:29 Mathematical finance Computational science Actuarial science Partial differential equations Monte Carlo method Computational finance Numerical analysis Inverse problem Numerical partial differential equations Mathematics Applied mathematics Science
974	Element Distinctness, Frequency Moments, and Sliding Windows Paul Beame Rapha¨el Clifford Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 07:07:18 Analysis of algorithms Computational complexity theory Time complexity Element distinctness problem Randomized algorithm Algorithm Big O notation Computational complexity of mathematical operations Asymptotically optimal algorithm Theoretical computer science Applied mathematics Mathematics
975	Generalised matching Raphael Clifford1 , Aram W. Harrow2 , Alexandru Popa1 , and Benjamin Sach1 1 Department of Computer Science, University of Bristol,UK Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 07:07:18 NP-complete problems Analysis of algorithms Time complexity Pattern matching NP Matching Boolean satisfiability problem Theoretical computer science Computational complexity theory Applied mathematics
976	A Generalization of SAT and #SAT for Robust Policy Evaluation∗ Erik Zawadzki Andr´e Platzer Geoffrey J. Gordon Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2013-11-06 19:31:44 Boolean algebra NP-complete problems Logic in computer science Electronic design automation Formal methods Boolean satisfiability problem True quantified Boolean formula Interpretation Constraint satisfaction problem Theoretical computer science Computational complexity theory Applied mathematics
977	Permuted Function Matching Rapha¨el Clifforda , Benjamin Sach∗,a a Department of Computer Science, University of Bristol,UK Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 07:07:18 Combinatorial optimization Dynamic programming Combinatorics Operations research Knapsack problem Matching Permutation Pattern matching Time complexity Theoretical computer science Computational complexity theory Applied mathematics
978	(Joint work with G. Havas and B. Majewski – appeared in Experimental Mathematics) CENTRAL PROBLEM: If d1, . . . , dm, m ≥ 2, are nonzero integers, find integers x1, . . . , xm such that d = gcd(d1, . . . , dm) = x1d1 Add to Reading List Source URL: www.numbertheory.org Language: English - Date: 2011-09-25 12:54:28 Lattice points Abstract algebra Euclidean algorithm Lenstra–Lenstra–Lovász lattice basis reduction algorithm Linear algebra Lattice Mathematics Algebra Computational number theory
979	European Conference on Information Systems (ECIS) ECIS 2005 Proceedings Association for Information Systems Year 2005 Add to Reading List Source URL: lamp.infosys.deakin.edu.au Language: English - Date: 2010-07-04 18:41:46 Educational psychology Human behavior Behavior Cognition Positive psychology Brainstorming Design Computational creativity Creative problem solving Problem solving Creativity Mind
980	Notes on Complexity Peter J. Cameron ii Preface Add to Reading List Source URL: www.maths.qmul.ac.uk Language: English - Date: 2001-03-23 05:47:08 Spanning tree Mathematical optimization Complexity classes Operations research Matroid theory Travelling salesman problem Minimum spanning tree Greedy algorithm NP-complete Theoretical computer science Computational complexity theory Mathematics

UPDATE